Substitutions over Infinite Alphabet Generating (-β)-Integers
نویسنده
چکیده
This contribution is devoted to the study of positional numeration systems with negative base introduced by Ito and Sadahiro in 2009, called (−β )-expansions. We give an admissibility criterion for more general case of (−β )-expansions and discuss the properties of the set of (−β )-integers, denoted by Z−β . We give a description of distances within Z−β and show that this set can be coded by an infinite word over an infinite alphabet, which is a fixed point of a non-erasing non-trivial morphism.
منابع مشابه
Substitutions over infinite alphabet generating (-\beta)-integers
This contribution is devoted to the study of positional numeration systems with negative base introduced by Ito and Sadahiro in 2009, called (−β )-expansions. We give an admissibility criterion for more general case of (−β )-expansions and discuss the properties of the set of (−β )-integers, denoted by Z−β . We give a description of distances within Z−β and show that this set can be coded by an...
متن کاملOn the Delone property of (-\beta)-integers
These sets were introduced in the domain of quasicrystallography, see e.g. [2]. It is not difficult to see that Z−β =Z when β ∈Z, and that Z−β = {0} when β < 1+ √ 5 2 . For β ≥ 1+ √ 5 2 , Ambrož et al. [1] showed that Z−β can be described by the fixed point of an anti-morphism on a possibly infinite alphabet. They also calculated explicitely the set of distances between consecutive (−β )-intege...
متن کاملLambda Words: A Class of Rich Words Defined Over an Infinite Alphabet
Lambda words are sequences obtained by encoding the differences between ordered elements of the form i + jθ, where i and j are non-negative integers and 1 < θ < 2. Lambda words are right-infinite words defined over an infinite alphabet that have connections with Sturmian words, Christoffel words, and interspersion arrays. We show that Lambda words are infinite rich words. Furthermore, any Lambd...
متن کاملOn the Delone property of (-β)-integers
These sets were introduced in the domain of quasicrystallography, see e.g. [2]. It is not difficult to see that Z−β =Z when β ∈Z, and that Z−β = {0} when β < 1+ √ 5 2 . For β ≥ 1+ √ 5 2 , Ambrož et al. [1] showed that Z−β can be described by the fixed point of an anti-morphism on a possibly infinite alphabet. They also calculated explicitely the set of distances between consecutive (−β )-intege...
متن کاملVerifying a Border Array in Linear Time
A border of a string x is a proper (but possibly empty) prefix of x that is also a suffix of x. The border array β = β[1..n] of a string x = x[1..n] is an array of nonnegative integers in which each element β[i], 1 ≤ i ≤ n, is the length of the longest border of x[1..i]. In this paper we first present a simple linear-time algorithm to determine whether or not a given array y = y[1..n] of intege...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 23 شماره
صفحات -
تاریخ انتشار 2012